Communication Complexity of Sum-Type Functions Invariant under Translation

Communication Complexity of Permutation-Invariant Functions

Motivated by the quest for a broader understanding of upper bounds in communication complexity, at least for simple functions, we introduce the class of “permutation-invariant” functions. A partial function f : {0, 1} × {0, 1} → {0,1, ?} is permutation-invariant if for every bijection π : {1, . . . , n} → {1, . . . , n} and every x,y ∈ {0, 1}, it is the case that f (x,y) = f (x,y). Most of the ...

the investigation of the relationship between type a and type b personalities and quality of translation

چکیده ندارد.

Direct Sum Questions in Classical Communication Complexity

In 1988, Karchmer and Wigderson generalized Yao’s two-party communication model of functions to relations and showed a remarkable connection of this model to the Boolean circuit model. A few years later, continuing this line of work, Karchmer, Raz, and Wigderson proposed a program to separate NC from P through direct-sum-type inequalities in communication complexity. This spurred the study of t...

Direct Sum Related Problems in Communication Complexity

1 Abbreviations and Notations 2

Communication complexity of composed functions